نتایج جستجو برای: hub median

تعداد نتایج: 161689  

Journal: :journal of industrial strategic management 2014
p. ghasemi

in this paper, a robust model presented is developed for hub covering flow problem in which hubs have capacity. this problem has two objective functions converting to a single-objective problem by using weighting method. firstly, the problem will be formulated in a certain case. then, by considering the demand as a non-random variable, it will be modeled by robust optimization. finally, by usin...

Journal: :international journal of industrial engineering and productional research- 0
vorya zarei , department of industrial engineering, mazandaran university of science and technology, babol, iran iraj mahdavi , department of industrial engineering, mazandaran university of science and technology, babol, iran reza tavakkoli-moghaddam , department of industrial engineering, college of engineering, tehran university, tehran, iran nezam mahdavi-amiri faculty of mathematical science, sharif university of technology, tehran, iran

the existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

Journal: :Sustainability 2022

In the literature, hub-networks have often been modeled such as only one mode is considered for all transportation. Also, consolidated demand flows are assumed to be transferred directly between each origin-destination hub pairs. The previous assumptions impose restrictions on practical applications of hub-networks. fact, various transport modes usually retained freight transport, and intermoda...

Iraj Mahdavi, Nezam Mahdavi-Amiri, Reza Tavakkoli-Moghaddam, Vorya Zarei,

The existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. Although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...

Journal: :international journal of supply and operations management 0
hamid tikani m.sc, department of industrial engineering, yazd university, yazd, iran mahboobeh honarvar assistant professor, department of industrial engineering, yazd university, yazd, iran yahia zare mehrjerdi professor, department of industrial engineering, yazd university, yazd, iran

in this paper, we study the problem of integrated capacitated hub location problem and seat inventory control considering concept and techniques of revenue management. we consider an airline company maximizes its revenue by utilizing the best network topology and providing proper booking limits for all itineraries and fare classes. the transportation system arises in the form of a star/star net...

In this paper an uncapacitated multiple allocation p-hub median problem is discussed. The model minimizes the transportation cost based on inventory service level at hubs through double paths between hubs. Inventory service level is defined as the percent of inventory shortage of vehicles at hubs according to passengers demand and replenishment time of vehicles. A real data from 25 nodes of mun...

The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...

Journal: :Transportation Research Part B: Methodological 2009

Journal: :Transportation Research Part C: Emerging Technologies 2016

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید